On the Structure of Linear Graphs
نویسنده
چکیده
Introduction. If the numbers of vertices and edges of a (linear) graph are suitably restricted, it is to be expected that something can be said about the configurations which the graph contains. As far as we know the first result in this direction is due to Turân. He proved that a graph with kn vertices and Ck,2n+1 edges always contains a complete graph of order k + 1. We shall here prove one such theorem (which arose originally out of a topological problem), and then list (without proofs) several other theorems and conjectures of this nature.
منابع مشابه
On the energy of non-commuting graphs
For given non-abelian group G, the non-commuting (NC)-graph $Gamma(G)$ is a graph with the vertex set $G$ $Z(G)$ and two distinct vertices $x, yin V(Gamma)$ are adjacent whenever $xy neq yx$. The aim of this paper is to compute the spectra of some well-known NC-graphs.
متن کاملOn the second order first zagreb index
Inspired by the chemical applications of higher-order connectivity index (or Randic index), we consider here the higher-order first Zagreb index of a molecular graph. In this paper, we study the linear regression analysis of the second order first Zagreb index with the entropy and acentric factor of an octane isomers. The linear model, based on the second order first Zag...
متن کاملDomination parameters of Cayley graphs of some groups
In this paper, we investigate domination number, $gamma$, as well as signed domination number, $gamma_{_S}$, of all cubic Cayley graphs of cyclic and quaternion groups. In addition, we show that the domination and signed domination numbers of cubic graphs depend on each other.
متن کاملOn Laplacian energy of non-commuting graphs of finite groups
Let $G$ be a finite non-abelian group with center $Z(G)$. The non-commuting graph of $G$ is a simple undirected graph whose vertex set is $Gsetminus Z(G)$ and two vertices $x$ and $y$ are adjacent if and only if $xy ne yx$. In this paper, we compute Laplacian energy of the non-commuting graphs of some classes of finite non-abelian groups..
متن کاملComputing Wiener and hyper–Wiener indices of unitary Cayley graphs
The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.
متن کاملطراحی بهینه موجشکن مرکب کیسونی تحت اثر امواج غیرخطی
Breakwaters are the important and the costly ones of the marine structures. Composite breakwater is one of the common types in the world. Because of the progress in marine industry in Iran in recent years, designers have noticed this structure. Because of the sensitivity of composite breakwater to environmental conditions, also construction costs, difficulty of repair and maintenance and import...
متن کامل